منابع مشابه
Testing Geometric Convexity
We consider the problem of determining whether a given set S in R is approximately convex, i.e., if there is a convex set K ∈ R such that the volume of their symmetric difference is at most vol(S) for some given . When the set is presented only by a membership oracle and a random oracle, we show that the problem can be solved with high probability using poly(n)(c/ ) oracle calls and computation...
متن کاملConvexity and geometric probabilities
In the development of the subject of Geometric Probabilities, there was always a close relationship to Convex Geometry. In these lectures, I want to demonstrate this relationship with a number of examples. These examples are of different types, since I want to cover various aspects. I start with hitting probabilities for convex bodies, which can be treated by means of integral geometry. Then I ...
متن کاملGeometric Plurisubharmonicity and Convexity - an Introduction
This is an essay on potential theory for geometric plurisubharmonic functions. It begins with a given closed subset Gl of the Grassmann bundle G(p, TX) of tangent p-planes to a riemannian manifold X . This determines a nonlinear partial differential equation which is convex but never uniformly elliptic (p < dimX). A surprising number of results in complex analysis carry over to this more genera...
متن کاملGeometric Embedding Properties of Bestvina-brady Subgroups
We compute the relative divergence and the subgroup distortion of Bestvina-Brady subgroups. We also show that for each integer n ≥ 3, there is a free subgroup of rank n of some right-angled Artin group whose inclusion is not a quasi-isometric embedding. This result answers the question of Carr about the minimum rank n such that some rightangled Artin group has a free subgroup of rank n whose in...
متن کاملThe Complexity of Simultaneous Geometric Graph Embedding
Given a collection of planar graphs G1, . . . , Gk on the same set V of n vertices, the simultaneous geometric embedding (with mapping) problem, or simply k-SGE, is to find a set P of n points in the plane and a bijection φ : V → P such that the induced straight-line drawings of G1, . . . , Gk under φ are all plane. This problem is polynomial-time equivalent to weak rectilinear realizability of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1978
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1978-0515537-7